Countable ultrahomogeneous undirected graphs
نویسندگان
چکیده
منابع مشابه
Maximal Chains of Isomorphic Subgraphs of Countable Ultrahomogeneous Graphs
For a countable ultrahomogeneous graph G = 〈G, ρ〉 let P(G) denote the collection of sets A ⊂ G such that 〈A, ρ ∩ [A]〉 ∼= G. The order types of maximal chains in the poset 〈P(G) ∪ {∅},⊂〉 are characterized as: (I) the order types of compact sets of reals having the minimum nonisolated, if G is the Rado graph or the Henson graph Hn, for some n ≥ 3; (II) the order types of compact nowhere dense set...
متن کاملOn K*-Ultrahomogeneous Graphs
Let C be any class of graphs. A graph G is C-ultrahomogeneous if every isomorphism between induced subgraphs belonging to C extends to an automorphism of G. We study graphs that are K∗-ultrahomogeneous, where K∗ is the class of complete graphs. We also explicitly classify the graphs that are tK∗-ultrahomogeneous, where tK∗ is the class of disjoint unions of complete graphs.
متن کاملMaximal Chains of Isomorphic Suborders of Countable Ultrahomogeneous Partial Orders
We investigate the poset 〈P(X) ∪ {∅},⊂〉, where X is a countable ultrahomogeneous partial order and P(X) the set of suborders of X isomorphic to X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in 〈P(X) ∪ {∅},⊂〉 are characterized as the order types of compact (resp. compact and nowhere dense) sets of reals having the minimum non-isolated. 2000 Math...
متن کاملOn C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملOn undirected Cayley graphs
We determine all periodic (and, therefore, all finite) semigroups G for which there exists a non-empty subset S of G such that the Cayley graph of G relative to S is an undirected Cayley graph. Let G be a semigroup, and let S be a nonempty subset of G. The Cayley graph Cay(G,S) of G relative to S is defined as the graph with vertex set G and edge set E(S) consisting of those ordered pairs (x, y...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1980
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1980-0583847-2